Range-based argumentation semantics as two-valued models
نویسندگان
چکیده
Characterizations of semi-stable and stage extensions in terms of 2-valued logical models are presented. To this end, the so-called GL-supported and GL-stage models are defined. These two classes of logical models are logic programming counterparts of the notion of range which is an established concept in argumentation semantics.
منابع مشابه
Ideal extensions as logical programming models
We show that the ideal sets of an argumentation framework can be characterized by two kinds of logical models: ideal models (2-valued logical models) and p-stable models (2-valued logical models). We also show that the maximal ideal set of an argumentation framework can be characterized by the well-founded+ model (a 3-valued logical model). These results argue for the logical foundations of the...
متن کاملSemi-Stable and Stage Extensions as 2-valued Models
This paper introduces the characterizations of both semi-stable and stage extensions in terms of 2-valued logical models. To this end, the so-called GL-supported and GL-stage models are defined. These two classes of logical models are logic programming counterparts of the notion of range which is a coined concept in argumentation semantics.
متن کاملComplete Extensions in Argumentation Coincide with Three-Valued Stable Models in Logic Programming
In this paper, we prove the correspondence between complete extensions in abstract argumentation and 3-valued stable models in logic programming. This result is in line with earlier work of [8] that identified the correspondence between the grounded extension in abstract argumentation and the well-founded model in logic programming, as well as between the stable extensions in abstract argumenta...
متن کاملThe Stable Abducible Argumentation Semantics
We look at a general way of inducing semantics in argumentation theory by means of a mapping defined on the family of 2-valued models of a normal program, which is constructed in terms of the argumentation framework. In this way we define a new argumentation semantics called stable abducible which lies in between the stable and the preferred semantics. The relevance of this new semantics is tha...
متن کاملDoing Argumentation using Theories in Graph Normal Form
We explore some links between abstract argumentation, logic and kernels in digraphs. Viewing argumentation frameworks as propositional theories in graph normal form, we observe that the stable semantics for argumentation can be given equivalently in terms of satisfaction and logical consequence in classical logic. We go on to show that the complete semantics can be formulated using Lukasiewicz ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- TPLP
دوره 17 شماره
صفحات -
تاریخ انتشار 2017